Approximate Substructure Searchin a Database of 3 D Graphs
نویسنده
چکیده
Given a database D of three dimensional (3D) graphs and a query graph Q, the problem of substructure search is deened as nding the graphs in D that contain Q. This is an important search operation in scientiic databases. This paper extends the search operation to nd those graphs D in D that \approximately" contain Q in the presence of rotation , translation, distortion, and node insert/delete in the substructures of D and Q. Our approach is an extension of a computer vision technique, called geometric hashing, for robotics applications. Experimental results obtained by running our algorithms on a database of chemical compounds demonstrate the good performance of the proposed approach.
منابع مشابه
An Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملSystematic benchmark of substructure search in molecular graphs - From Ullmann to VF2
UNLABELLED BACKGROUND Searching for substructures in molecules belongs to the most elementary tasks in cheminformatics and is nowadays part of virtually every cheminformatics software. The underlying algorithms, used over several decades, are designed for the application to general graphs. Applied on molecular graphs, little effort has been spend on characterizing their performance. Therefor...
متن کاملA Branch and Bound Algorithm for Matching Protein Structures
An efficient branch and bound algorithm for matching protein structures has been developed. The compared protein structures are represented as graphs and a product graph of these graphs is calculated. The resulting product graph is then the input to our algorithm. A maximum clique in the product graph corresponds to the maximum common substructure in the original graphs. Our algorithm, which gi...
متن کاملApproximation Algorithms for 3-d Common Substructure Identiication in Drug and Protein Molecules
Identifying the common 3-D substructure between two drug or protein molecules is an important problem in synthetic drug design and molecular biology. This problem can be represented as the following geometric pattern matching problem: given two point sets A and B in three-dimensions, and a real number > 0, nd the maximum cardinality subset S A for which there is an isometry I, such that each po...
متن کاملREAFUM: Representative Approximate Frequent Subgraph Mining
Noisy graph data and pattern variations are two thorny problems faced by mining frequent subgraphs. Traditional exact-matching based methods, however, only generate patterns that have enough perfect matches in the graph database. As a result, a pattern may either remain undetected or be reported as multiple (almost identical) patterns if it manifests slightly different instances in different gr...
متن کامل